Combining Logic and Control to Characterize Global Invariants of Prolog Programs
نویسندگان
چکیده
The behaviour of logic programs (with various built-in's) is described in terms of sets of substitutions associated with the control points of the program. These sets are deened by means of an operational semantics O, based on a description of uniication as predicate transformer. It is shown that O subsumes the semantics of logic programs consisting of the set of computed substitutions obtained from nite preexes of SLD-derivations with Prolog selection rule. Moreover O is used as base semantics for performing dataaow analysis of logic programs.
منابع مشابه
Interpreting Bayesian Logic Programs
Various proposals for combining first order logic with Bayesian nets exist. We introduce the formalism of Bayesian logic programs, which is basically a simplification and reformulation of Ngo and Haddawys probabilistic logic programs. However, Bayesian logic programs are sufficiently powerful to represent essentially the same knowledge in a more elegant manner. The elegance is illustrated by th...
متن کاملSpeeding - up Logic Programs by Combining EBG and FOIL
This paper presents an algorithm that combines traditional EBL techniques and recent developments in inductive logic programming to learn e ective clause selection rules for Prolog programs. When these control rules are incorporated into the original program, signi cant speed-up may be achieved. The algorithm produces not only EBL-like speed up of problem solvers, but is capable of automaticall...
متن کاملSelf-interpreter for Prolog by Aseel Alkhelaiwi a Thesis Submitted in Partial Fulfillment of the Requirements for the Degree of Master of Science in Computer Science University of Rhode Island
The semantics of Prolog programs is usually given in terms of model theoretic semantics. However, this does not adequately characterize the computational behavior of Prolog programs. Prolog implementations typically use a depth-first, left-to-right evaluation strategy based on the textual order of clauses and literals in a program. In this paper we introduce a self-interpreter for Prolog, which...
متن کاملCombining FOIL and EBG to Speed-up Logic Programs
This paper presents an algorithm that combines traditional EBL techniques and recent developments in inductive logic programming to learn e ective clause selection rules for Prolog programs. When these control rules are incorporated into the original program, signi cant speed-up may be achieved. The algorithm is shown to be an improvement over competing EBL approaches in several domains. Additi...
متن کاملProposal for Global Variables in Standard Prolog
Data types of Prolog are essentially restricted to terms at the cost of compactness and the unity of a logic programming language. On the other hand, it has been commonly recognized that Prolog has two practical problems, which considerably prevent the language and logic programming from being used for broader area of information processing. One problem is that Standard Prolog does not have the...
متن کامل